On a classification of finite statistical tests
نویسنده
چکیده
Statistical tests of random sequences are often used in cryptography in order to perform some routine checks for random and pseudo-random number generators. Most of the test suites available are based on the theory of hypothesis testing which allows one to decide whether a sample has been drawn following a certain distribution. In this article, we develop a theoretical foundation of statistical tests of random sequences and hypothesis testing with a focus on cryptographic applications and we draw some interesting practical consequences.
منابع مشابه
Proposing a Novel Cost Sensitive Imbalanced Classification Method based on Hybrid of New Fuzzy Cost Assigning Approaches, Fuzzy Clustering and Evolutionary Algorithms
In this paper, a new hybrid methodology is introduced to design a cost-sensitive fuzzy rule-based classification system. A novel cost metric is proposed based on the combination of three different concepts: Entropy, Gini index and DKM criterion. In order to calculate the effective cost of patterns, a hybrid of fuzzy c-means clustering and particle swarm optimization algorithm is utilized. This ...
متن کاملClassification of finite simple groups whose Sylow 3-subgroups are of order 9
In this paper, without using the classification of finite simple groups, we determine the structure of finite simple groups whose Sylow 3-subgroups are of the order 9. More precisely, we classify finite simple groups whose Sylow 3-subgroups are elementary abelian of order 9.
متن کاملAlmost simple groups with Socle $G_2(q)$ acting on finite linear spaces
After the classification of the flag-transitive linear spaces, the attention has been turned to line-transitive linear spaces. In this article, we present a partial classification of the finite linear spaces $mathcal S$ on which an almost simple group $G$ with the socle $G_2(q)$ acts line-transitively.
متن کاملCharacterization of finite $p$-groups by the order of their Schur multipliers ($t(G)=7$)
Let $G$ be a finite $p$-group of order $p^n$ and $|{mathcal M}(G)|=p^{frac{1}{2}n(n-1)-t(G)}$, where ${mathcal M}(G)$ is the Schur multiplier of $G$ and $t(G)$ is a nonnegative integer. The classification of such groups $G$ is already known for $t(G)leq 6$. This paper extends the classification to $t(G)=7$.
متن کاملClassification of encrypted traffic for applications based on statistical features
Traffic classification plays an important role in many aspects of network management such as identifying type of the transferred data, detection of malware applications, applying policies to restrict network accesses and so on. Basic methods in this field were using some obvious traffic features like port number and protocol type to classify the traffic type. However, recent changes in applicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. in Math. of Comm.
دوره 1 شماره
صفحات -
تاریخ انتشار 2007